The Algebraic Path Problem
نویسنده
چکیده
This is a brief intro to the algebraic path problem, and much of this material is based on Rote’s excellent paper (Günter Rote: A Systolic Array Algorithm for the Algebraic Path Problem (Shortest Paths; Matrix Inversion), Computing, 34(3):191–219, 1985)
منابع مشابه
Numerical solution of higher index DAEs using their IAE's structure: Trajectory-prescribed path control problem and simple pendulum
In this paper, we solve higher index differential algebraic equations (DAEs) by transforming them into integral algebraic equations (IAEs). We apply collocation methods on continuous piece-wise polynomials space to solve the obtained higher index IAEs. The efficiency of the given method is improved by using a recursive formula for computing the integral part. Finally, we apply the obtained algo...
متن کاملThe algebraic Monge property and path problems
We give algorithmic results for combinatorial problems with cost arrays possessing certain algebraic Monge properties. We extend Monge-array results for two shortest path problems to a general algebraic setting, with values in an ordered commutative semigroup, if the semigroup operator is strictly compatible with the order relation. We show how our algorithms can be modified to solve bottleneck...
متن کاملThe Algebraic Complexity of Shortest Paths in Polyhedral Spaces
In this paper we show that the problem of finding the shortest path between two points in Euclidean 3-space, bounded by a finite collection of polyhedral obstacles, is in general not solvable by radicals over the field of rationals. The problem is shown to be not solvable even for the case when only two obstacle edges are encountered in the shof[est path in 3-space. One direct consequence of th...
متن کاملLayered Graph Traversals and Hamiltonian Path Problems - An Algebraic Approach
Using an algebra of paths we present abstract algebraic derivations for two problem classes concerning graphs, viz. layer oriented traversal and computing sets of Hamiltonian paths. In the rst case, we are even able to abstract to the very general setting of Kleene algebras. Applications include reachability and a shortest path problem as well as topological sorting, cycle detection and nding m...
متن کاملComputing Minimum-Link Path in a Homotopy Class amidst Semi-Algebraic Obstacles in the Plane
Given a set of semi-algebraic obstacles in the plane and two points in the same connected component of the complement, the problem is to construct a polygonal path between these points which has the minimum number of segments (links) and the minimum`total turn', that is the sum of absolute values of angles of turns of the consecutive polygon links. We describe an algorithm that solves the probl...
متن کامل